Succinct Partial Sums and Fenwick Trees

We consider the well-studied partial sums problem in succint space where one is to maintain an array of n k-bit integers subject to updates such that partial sums queries can be efficiently answered. We present two succint versions of the Fenwick Tree - which is known for its simplicity and practicality. Our results hold in the encoding model where one is allowed to reuse the space from the input data. Our main result is the first that only requires nk + o(n) bits of space while still supporting sum/update in O(log_b n) / O(b log_b n) time where 2 <= b <= log^O(1) n. The second result shows how optimal time for sum/update can be achieved while only slightly increasing the space usage to nk + o(nk) bits. Beyond Fenwick Trees, the results are primarily based on bit-packing and sampling - making them very practical - and they also allow for simple optimal parallelization

Spanning Properties of Theta-Theta Graphs

We study the spanning properties of Theta-Theta graphs. Similar in spirit with the Yao-Yao graphs, Theta-Theta graphs partition the space around each vertex into a set of k cones, for some fixed integer k > 1, and select at most one edge per cone. The difference is in the way edges are selected. Yao-Yao graphs select an edge of minimum length, whereas Theta-Theta graphs select an edge of minimum orthogonal projection onto the cone bisector. It has been established that the Yao-Yao graphs with parameter k = 6k' have spanning ratio 11.67, for k' >= 6. In this paper we establish a first spanning ratio of $7.82$ for Theta-Theta graphs, for the same values of $k$. We also extend the class of Theta-Theta spanners with parameter 6k', and establish a spanning ratio of $16.76$ for k' >= 5. We surmise that these stronger results are mainly due to a tighter analysis in this paper, rather than Theta-Theta being superior to Yao-Yao as a spanner. We also show that the spanning ratio of Theta-Theta graphs decreases to 4.64 as k' increases to 8. These are the first results on the spanning properties of Theta-Theta graphs.Comment: 20 pages, 6 figures, 3 table

Finding the Median (Obliviously) with Bounded Space

We prove that any oblivious algorithm using space $S$ to find the median of a list of $n$ integers from $\{1,...,2n\}$ requires time $\Omega(n \log\log_S n)$. This bound also applies to the problem of determining whether the median is odd or even. It is nearly optimal since Chan, following Munro and Raman, has shown that there is a (randomized) selection algorithm using only $s$ registers, each of which can store an input value or $O(\log n)$-bit counter, that makes only $O(\log\log_s n)$ passes over the input. The bound also implies a size lower bound for read-once branching programs computing the low order bit of the median and implies the analog of $P \ne NP \cap coNP$ for length $o(n \log\log n)$ oblivious branching programs

Modulus Computational Entropy

The so-called {\em leakage-chain rule} is a very important tool used in many security proofs. It gives an upper bound on the entropy loss of a random variable $X$ in case the adversary who having already learned some random variables $Z_{1},\ldots,Z_{\ell}$ correlated with $X$, obtains some further information $Z_{\ell+1}$ about $X$. Analogously to the information-theoretic case, one might expect that also for the \emph{computational} variants of entropy the loss depends only on the actual leakage, i.e. on $Z_{\ell+1}$. Surprisingly, Krenn et al.\ have shown recently that for the most commonly used definitions of computational entropy this holds only if the computational quality of the entropy deteriorates exponentially in $|(Z_{1},\ldots,Z_{\ell})|$. This means that the current standard definitions of computational entropy do not allow to fully capture leakage that occurred "in the past", which severely limits the applicability of this notion. As a remedy for this problem we propose a slightly stronger definition of the computational entropy, which we call the \emph{modulus computational entropy}, and use it as a technical tool that allows us to prove a desired chain rule that depends only on the actual leakage and not on its history. Moreover, we show that the modulus computational entropy unifies other,sometimes seemingly unrelated, notions already studied in the literature in the context of information leakage and chain rules. Our results indicate that the modulus entropy is, up to now, the weakest restriction that guarantees that the chain rule for the computational entropy works. As an example of application we demonstrate a few interesting cases where our restricted definition is fulfilled and the chain rule holds.Comment: Accepted at ICTS 201

Flexible and Robust Privacy-Preserving Implicit Authentication

Implicit authentication consists of a server authenticating a user based on the user's usage profile, instead of/in addition to relying on something the user explicitly knows (passwords, private keys, etc.). While implicit authentication makes identity theft by third parties more difficult, it requires the server to learn and store the user's usage profile. Recently, the first privacy-preserving implicit authentication system was presented, in which the server does not learn the user's profile. It uses an ad hoc two-party computation protocol to compare the user's fresh sampled features against an encrypted stored user's profile. The protocol requires storing the usage profile and comparing against it using two different cryptosystems, one of them order-preserving; furthermore, features must be numerical. We present here a simpler protocol based on set intersection that has the advantages of: i) requiring only one cryptosystem; ii) not leaking the relative order of fresh feature samples; iii) being able to deal with any type of features (numerical or non-numerical). Keywords: Privacy-preserving implicit authentication, privacy-preserving set intersection, implicit authentication, active authentication, transparent authentication, risk mitigation, data brokers.Comment: IFIP SEC 2015-Intl. Information Security and Privacy Conference, May 26-28, 2015, IFIP AICT, Springer, to appea

Care during the third stage of labour: obstetricians views and practice in an Albanian maternity hospital

<p>Abstract</p> <p>Background</p> <p>Relatively little is known about current practice during the third stage of labour in low and middle income countries. We conducted a survey of attitudes and an audit of practice in a large maternity hospital in Albania.</p> <p>Methods</p> <p>Survey of 35 obstetricians and audit of practice during the third stage was conducted in July 2008 at a tertiary referral hospital in Tirana. The survey questionnaire was self completed. Responses were anonymous. For the audit, information collected included time of administration of the uterotonic drug, gestation at birth, position of the baby before cord clamping, cord traction, and need for resuscitation.</p> <p>Results</p> <p>77% (27/35) of obstetricians completed the questionnaire, of whom 78% (21/27) reported always or usually using active management, and 22% (6/27) always or usually using physiological care. When using active management: 56% (15/27) gave the uterotonic after cord clamping; intravenous oxytocin was almost always the drug used; and 71% (19/27) clamped the cord within one minute. For physiological care: 42% (8/19) clamped the cord within 20 seconds, and 96% (18/19) within one minute. 93% would randomise women to a trial of early versus late cord clamping.</p> <p>Practice was observed for 156 consecutive births, of which 26% (42/156) were by caesarean section. A prophylactic uterotonic was used for 87% (137/156): this was given after cord clamping for 55% (75/137), although timing of administration was not recorded for 21% (29/137). For 85% of births (132/156) cord clamping was within 20 seconds, and for all babies it was within 50 seconds. Controlled cord traction was used for 49% (76/156) of births.</p> <p>Conclusions</p> <p>Most obstetricians reported always or usually using active management for the third stage of labour. For timing and choice of the uterotonic drug, reported practice was similar to actual practice. Although some obstetricians reported they waited longer than one minute before clamping the cord, this was not observed in practice. Controlled cord traction was used for half the births.</p

A genetic contribution from the Far East into Ashkenazi Jews via the ancient Silk Road

Contemporary Jews retain a genetic imprint from their Near Eastern ancestry, but obtained substantial genetic components from their neighboring populations during their history. Whether they received any genetic contribution from the Far East remains unknown, but frequent communication with the Chinese has been observed since the Silk Road period. To address this issue, mitochondrial DNA (mtDNA) variation from 55,595 Eurasians are analyzed. The existence of some eastern Eurasian haplotypes in eastern Ashkenazi Jews supports an East Asian genetic contribution, likely from Chinese. Further evidence indicates that this connection can be attributed to a gene flow event that occurred less than 1.4 kilo-years ago (kya), which falls within the time frame of the Silk Road scenario and fits well with historical records and archaeological discoveries. This observed genetic contribution from Chinese to Ashkenazi Jews demonstrates that the historical exchange between Ashkenazim and the Far East was not confined to the cultural sphere but also extended to an exchange of genes

Umbilical Cord Mercury Concentration as Biomarker of Prenatal Exposure to Methylmercury

Biomarkers are often applied to assess prenatal exposure to methylmercury in research and surveillance. In a prospective study in the Faroe Islands, the main exposure biomarkers were the mercury concentrations in cord blood and maternal hair obtained at parturition. We have now supplemented these exposure biomarkers with mercury analyses of umbilical cord tissue from 447 births. In particular, when expressed in relation to the dry weight of the tissue, the cord mercury concentration correlated very well with that in cord blood. Structural equation model analysis showed that these two biomarkers have average total imprecision of about 30%, which is much higher than the laboratory error. The imprecision of the dry-weight–based concentration was lower than that of the wet-weight–based parameter, and it was intermediate between those of the cord blood and the hair biomarkers. In agreement with this finding, regression analyses showed that the dry-weight cord mercury concentration was almost as good a predictor of methylmercury-associated neuropsychologic deficits at 7 years of age as was the cord-blood mercury concentration. Cord mercury analysis can therefore be used as a valid measure of prenatal methylmercury exposure, but appropriate adjustment for the imprecision should be considered

Placental transfusion: a review

Recently there have been a number of studies and presentations on the importance of providing a placental transfusion to the newborn. Early cord clamping is an avoidable, unphysiologic intervention that prevents the natural process of placental transfusion. However, placental transfusion, although simple in concept, is affected by multiple factors, is not always straightforward to implement, and can be performed using different methods, making this basic procedure important to discuss. Here, we review three placental transfusion techniques: delayed cord clamping, intact umbilical cord milking and cut-umbilical cord milking, and the evidence in term and preterm newborns supporting this practice. We will also review several factors that influence placental transfusion, and discuss perceived risks versus benefits of this procedure. Finally, we will provide key straightforward concepts and implementation strategies to ensure that placental-to-newborn transfusion can become routine practice at any institution